ACS Algorithms for Complex Shapes with Certified Numerics and Topology Application of algebraic tools to CSG operations on curves and surfaces
نویسندگان
چکیده
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for 3 D problems , related to the topology of implicit
In this work, we propose an algorithm based on subresultants computation to compute the topology of implicit curves defined as intersection of implicit surfaces. Our approach is symbolic-numeric, but certification of the result can be obtained from the simplification of the generic position testing. To check the generic position, our approach treats together a familly of critical points, making...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Experimental implementation of more operations on algebraic numbers, possibly with the addition of numeric filters, and of robust operations on small polynomial systems
We continue the work in [6] and present our maple implementation of an algebraic toolbox capable of doing computations with one and two real algebraic numbers and real solving bivariate polynomial systems. In addition we describe new functions of the subpackage of the C++ library synaps for root isolation of univariate and multivariate polynomials. For this implementation we combine symbolic an...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Computation of the medial axis of smooth curves with topological guarantees
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Review of CGAL package for skin surface meshing
This report includes a review about the first submission of the CGAL package for isotopic meshing of skin surfaces. It provides some suggestions, namely to simplify the user interface of the package and also to make skin surfaces compatible with the CGAL 3D Surface Mesher package.
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for the Voronoi diagram of ellipses, leading to an experimental implementation
We study the four predicates required for the Voronoi diagram of ellipses in the plane, under the Euclidean metric, based on an incremental algorithm. The report concentrates on InCircle, which is the hardest predicate: it decides the position of a query ellipse relative to the Voronoi circle of three given ellipses. The implementation of InCircle combines a certified numeric algorithm with alg...
متن کامل